Conservativity of Fibred Logics without Shared Connectives *
نویسنده
چکیده
Fibring is a general mechanism for combining logics that provides valuable insight on designing and understanding complex logical systems. Mostly, the research on fibring has focused on its model and proof-theoretic aspects, and on transference results for relevant metalogical properties. Conservativity, however, a property that lies at the very heart of the original definition of fibring, has not deserved similar attention. In this paper, we provide the first full characterization of the conservativity of fibred logics, in the special case when the logics being combined do not share connectives. Namely, under this assumption, we provide necessary and sufficient conditions for a fibred logic to be a conservative extension of the logics being combined. Our characterization relies on a key technical result that provides a complete description of what follows from a set of non-mixed hypotheses in the fibred logic, in terms of the logics being combined. With such a powerful tool in hand, we also explore a semantic application. Namely, we use our key technical result to show that finitevaluedness is not preserved by fibring.
منابع مشابه
Deciding theoremhood in fibred logics without shared connectives
Fibring is a powerful mechanism for combining logics, and an essential tool for designing and understanding complex logical systems. Abstract results about the semantics and proof-theory of fibred logics have been extensively developed, including general soundness and completeness preservation results. Decidability, however, a key ingredient for the automated support of the fibred logic, has no...
متن کاملDecidability and complexity of fibred logics without shared connectives
Fibring is a powerful mechanism for combining logics, and an essential tool for designing and understanding complex logical systems. Abstract results about the semantics and proof-theory of fibred logics have been extensively developed, including general preservation results for metalogical properties like soundness and (sufficient conditions for) completeness. Decidability, however, a key ingr...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملConservativity for logics of justified belief: Two approaches
In [1], Fitting showed that the standard hierarchy of logics of justified knowledge is conservative (e.g. a logic with positive introspection operator ! is conservative over the logic without !). We do the same with most logics of justified belief, showing both conservation of sequent proofs and extensibility of models. A brief example shows that conservativity does not hold for logics of justi...
متن کاملOn meet-combination of logics
When combining logics while imposing the sharing of connectives, the result is frequently inconsistent. In fact, in fibring, fusion and other forms of combination reported in the literature, each shared connective inherits the logical properties of each of its components. A new form of combining logics (meet-combination) is proposed where such a connective inherits only the common logical prope...
متن کامل